Constraint%2DAware Complex Event Pattern Detection over Streams.

Cluster%2Dand%2Dconquer hierarchical multi%2Dmetric query processing in large%2Dscale database federations.

Achieving High Output Quality under Limited Resources through Structure%2Dbased Spilling in XML Streams.
Because of high volumes and unpredictable arrival rates, stream processing systems are not always able to keep up with input data- resulting in buffer overflow and uncontrolled loss of data. To produce eventually complete results, load spilling, which pushes some fractions of data to disks temporarily, is commonly employed in relational stream engines. In this work, we now introduce “structurebased spilling”, a spilling technique customized for XML streams by considering the partial spillage of possibly complex XML elements. Such structure-based spilling brings new challenges. When a path is spilled, multiple paths may be affected. We analyze possible spilling effects on the query paths and how to execute the “reduced ” query to produce partial results. To select the reduced query that maximizes output quality, we develop three optimization strategies, namely, OptR, OptPrune and ToX. We also examine the clean-up stage to guarantee that an entire result set is eventually generated by producing supplementary results. Our experimental study demonstrates that our proposed solutions consistently achieve higher quality results compared to the state-of-the-art techniques. 1.
Performance Driven Database Design for Scalable Web Applications.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Semantic Optimization of XQuery by Rewriting.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Constraint%2Daware event stream processing.

Interval event stream processing.

XML Views.
Existing systems for XML views only support selection operation  applied in the views and cannot validate views. In this paper, we propose a systematic  approach to design valid XML views. First, we transform the semistructured  XML source documents into a semantically rich Object-RelationshipAttribute  model designed for SemiStructured data (ORA-SS). Second, we enrich  the ORA-SS diagram with semantics such as participation constraints of object  classes and distinguishing between attributes of object classes and relationship  types, which cannot be expressed in the XML document. Third, we use the additional  semantics to develop a set of rules to guide the design of valid XML  views. We identify four transformation operations for creating XML views,  namely, selection, projection, join and swap operation. Finally, we develop a  comprehensive algorithm that checks for the validity of XML views constructed  by applying the four operations.
E%2DTec A Constraint%2DAware Query Engine for Pattern Detection over Event Streams.

XML Views.
Existing systems for XML views only support selection operation  applied in the views and cannot validate views. In this paper, we propose a systematic  approach to design valid XML views. First, we transform the semistructured  XML source documents into a semantically rich Object-RelationshipAttribute  model designed for SemiStructured data (ORA-SS). Second, we enrich  the ORA-SS diagram with semantics such as participation constraints of object  classes and distinguishing between attributes of object classes and relationship  types, which cannot be expressed in the XML document. Third, we use the additional  semantics to develop a set of rules to guide the design of valid XML  views. We identify four transformation operations for creating XML views,  namely, selection, projection, join and swap operation. Finally, we develop a  comprehensive algorithm that checks for the validity of XML views constructed  by applying the four operations.
Using Mixed%2DEffects Modeling to Analyze Different Grain%2DSized Skill Models in an Intelligent Tutoring System.

An Optimized Two%2DStep Solution for Updating XML Views.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Constraint%2DAware XSLT Evaluation.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
ELF A Constraint%2DAware XQuery Engine for Processing XML Streams with Minimized Memory Footprint.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Efficiently loading and processing XML streams.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Automaton in or out run%2Dtime plan optimization for XML stream processing.

Utility%2Ddriven load shedding for xml stream processing.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Processing recursive XQuery over XML streams The Raindrop approach.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Updating Views Over Recursive XML.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Event Stream Processing with Out%2Dof%2DOrder Data Arrival.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Optimization of nested XQuery expressions with orderby clauses.

HUX a schemacentric approach for updating XML views.

U%2DFilter A Lightweight XML View Update Checker.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Incremental Maintenance of Materialized XQuery Views.
Keeping views fresh by maintaining the consistency between materialized views and their base data in the presence of base updates is a critical prob-lem for many applications, including data warehousing and data integra-tion. While heavily studied for traditional databases, the maintenance of XML views remains largely unexplored. Maintaining XML views is com-plex due to the richness of the XML data model and the powerful capabili-ties of XML query languages, such as XQuery. This dissertation proposes a comprehensive solution for the general problem of maintaining materialized XQuery views. Our solution is the first to enable the maintenance of a large class of XQuery views including XPath expressions, FLWOR expressions, and Element Constructors. These views may contain arbitrary result construction and arbitrary grouping and join operations. Our solution also supports the unique order requirements of XQuery including source document order and query order.
Processing Recursive XQuery over XML Streams The Raindrop Approach.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
R%2DSOX Runtime Semantic Query Optimization over XML Streams.

HUX Handling Updates in XML.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Updating XML views published over relational databases Towards the existence of a correct update mapping.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Automaton meets algebra A hybrid paradigm for XML stream processing.

Join minimization in XML%2Dto%2DSQL translation an algebraic approach.

Optimization of Nested XQuery Expressions with Orderby Clauses.

Incremental Fusion of XML Fragments Through Semantic Identifiers.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata


Taxonomy of XML schema languages using formal language theory.
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
Constraint Specification for XML A Closer Look.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Semantic Query Optimization in an Automata%2DAlgebra Combined XQuery Engine over XML Streams.
Our Raindrop framework [6, 9] aims at tackling challenges of stream processing that are particular to XML. In contrast to the tuple-based or object-based data streams, XML streams are usually modeled as a sequence of primitive tokens, such as a start tag, an end tag or a PCDATA item. Unlike a self-contained tuple or object whose semantics are completely determined by its own values, a token lacks semantics without the context provided by other tokens in the stream. This poses specific challenges for query processing over such XML streams. State-of-the-Art. Since the automata model was originally designed for matching patterns over strings, it is a natural paradigm for structural pattern retrieval on XML token streams [7, 8, 4]. However the automata model suffers from not being able to strike a balance between the expressive power of the query it can handle and the manageability of its constructs. It either provides limited &#034;recognizer-like&#034; query capabilities, e.g., [4] gives only boolean answers...
EReX A Conceptual Model for XML.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
Schema Conversion Methods between XML and Relational Models.
In this chapter, three semantics-based schema conversion methods are presented:  1) CPI converts an XML schema to a relational schema while preserving semantic  constraints of the original XML schema, 2) NeT derives a nested structured  XML schema from a flat relational schema by repeatedly applying the nest operator  so that the resulting XML schema becomes hierarchical, and 3) CoT takes a relational  schema as input, where multiple tables are interconnected through inclusion dependencies  and generates an equivalent XML schema as output.
Understanding the semantics of sensor data.
[G5] [G6] [G7] [G8] [G9] NSF, SGER ($120,327 from Sep 2009 – May 2011), Towards a Generic Provenance Metadata
NeT %26 CoT translating relational schemas to XML schemas using semantic constraints.
Two algorithms, called NeT and CoT, to translate relational schemas to XML schemas using various semantic constraints are presented. The XML schema representation we use is a language-independent formalism named XSchema, that is both precise and concise. A given XSchema can be mapped to a schema in any of the existing XML schema language proposals. Our proposed algorithms have the following characteristics: (1) NeT derives a nested structure from a flat relational model by repeatedly applying the nest operator on each table so that the resulting XML schema becomes hierarchical, and (2) CoT considers not only the structure of relational schemas, but also semantic constraints such as inclusion dependencies during the translation. It takes as input a relational schema where multiple tables are interconnected through inclusion dependencies and converts it into a good XSchema. To validate our proposals, we present experimental results using both real schemas from the UCI repository and synthetic schemas from TPC-H.
XML to Relational Conversion Using Theory of Regular Tree Grammars.
In this paper, we study the different steps  of translation from XML to relational mod-  els, while maintaining semantic constraints.
NeT %26 CoT Inferring XML Schemas from Relational World.

Semantic Data Modeling Using XML Schemas.
Most research on XML has so far largely neglected the data  modeling aspects of XML schemas. In this paper, we attempt to make  a systematic approach to data modeling capabilities of XML schemas.
Taxonomy of XML Schema Languages Using Formal Language Theory.
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
Nesting%2DBased Relational%2Dto%2DXML Schema Translation.
this paper, we study the problems in this con- version. Especially, we are interested in finding XML schema (e.g., DTD, XML-Schema, RELAX) that best describes the existing relational schema. Having the XML schema that precisely describes the semantics and structures of the original relational data is important to further maintain the converted XML documents in future. We first present a straightforward relational to XML translation algorithm, called Flat Translation (FT). Since FT maps the fiat relational model to the fiat XML model in a one-to-one manner, it does not utilize the regular expression of element content models at all. Then, we present our ongoing work, called Nesting-based Translation (NET), to remedy the problems found in FT. NeT derives nested structures from a fiat relational model by the use of the nest operator so that the resulting DTD is more intuitive and precise than otherwise
The Effect of Incest Prevention on Genetic Drift.

The Effects of Control Parameters and Restarts on Search Stagnation in Evolutionary Programming.

